Poisson Flows in Single Class Open Networks of Quasireversible Queues

نویسنده

  • J. WALRAND
چکیده

It was shown in [l] and [2] that ‘he flows in open networks of 9 /M/l queues with a single class of customers obe;r the so-called ‘loop criterion’: In equilibrium a flow on a link of such a network is Poisson if and only if the link is not part of a loop. In [3] that criterion was shown to apply to networks of ./M/s queues, i.e., to Jackson networks (see [4]). It was also shown in [3] that this classification of the flows does lnot hold for multiclass networks. The purpose of this note is to provide a simple argument which proves thlat the loop criterion hol3s in a single class open networks of quasireversible queues (see e.g. [7]). A stability condition needed for the argument is shown to be satisfied by the usual networks of quasireversible nodes with bounded service rates (e.g., [S, 61). The paper is organized as follows: In the next section the basic properties of the networks under consideration are briefly reviewed and the necessary notation is introduced, In Section 3 the loop criterion is established under a stability condition. Section 4 is devoted to the discussion of that condition.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A heuristic method for consumable resource allocation in multi-class dynamic PERT networks

This investigation presents a heuristic method for consumable resource allocation problem in multi-class dynamic Project Evaluation and Review Technique (PERT) networks, where new projects from different classes (types) arrive to system according to independent Poisson processes with different arrival rates. Each activity of any project is operated at a devoted service station located in a n...

متن کامل

The Heavy-traffic Botrleneck Phenomenon in Open Queueing Networks

This note describes a simulation experiment involving nine exponential queues in series with a non-Poisson arrival process, which demonstrates that the heavy-traffic bottleneck phenomenon can occur in practice (at reasonable traffic intensities) as well as in theory (in the limit). The results reveal limitations in customary two-moment approximations for open queueing networks. queues * open qu...

متن کامل

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

به‌دست آوردن میانگین زمان تکمیل‌پروژه در شبکه‌های پرت‌پویا‌ (سیستم چندپروژه‌ای) با ظرفیت محدود

In this paper, dynamic PERT networks with finite capacity of concurrent projects are expressed in the framework of networks of queues. In this investigation, it is assumed that the system capacity is finite and new projects are generated according to a Poisson process. There is only one server in every service station and the discipline of queue is FCFS (Fist Come, First Served). Each activity ...

متن کامل

Triggered batch movement in queueing networks

In the queueing network literature there have recently appeared a number of examples of networks in which events are triggered by the occurrence of other events. For example Henderson and Taylor [16] discuss queueing networks with external "interruptions", which arrive from outside the network, end the service of a customer at a queue, and route it through or out of the network even though it h...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001